A new semilocal convergence theorem for Newton's method involving twice Fréchet-differentiability at only one point

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Semilocal Convergence Theorem for the Weierstrass Method from Data at One Point

In this paper we present a new semilocal convergence theorem from data at one point for the Weierstrass iterative method for the simultaneous computation of polynomial zeros. The main result generalizes and improves all previous ones in this area.

متن کامل

Semilocal Convergence Theorem for the Inverse-Free Jarratt Method under New Hölder Conditions

Under the new Hölder conditions, we consider the convergence analysis of the inverse-free Jarratt method in Banach space which is used to solve the nonlinear operator equation. We establish a new semilocal convergence theorem for the inverse-free Jarratt method and present an error estimate. Finally, three examples are provided to show the application of the theorem.

متن کامل

A strong convergence theorem for solutions of zero point problems and fixed point problems

Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated‎. ‎A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces‎.

متن کامل

On the Semilocal Convergence of Steffensen’s Method

We provide a semilocal convergence analysis of a general Steffensen’s method in a Banach space setting. In some interesting special cases, we expand the applicability of this method. A numerical example involving the solution of a nonlinear two boundary problem is also provided in this study. MSC 2010. 65H10, 65G99, 65J15, 47H17, 49M15.

متن کامل

A New Schema Theorem for GeneticProgramming with One - point

We review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, simpler deenition of the concept of schema for GP which is closer to the original concept of schema in genetic algorithms (GAs). Along with a new form of crossover, one-point crossover, and point mutation this concept of schema has been use...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2005

ISSN: 0377-0427

DOI: 10.1016/j.cam.2004.12.005